hard approxim algorithm ddivers exist solut privaci preserv public classifi theoret heurist categori guarante provabl low inform loss incur gigant loss worst case shown empir perform real input numer heurist algorithm develop satisfi advanc privaci principl divers close theoret categori limit anonym earliest principl sever vulner privaci attack motiv present theoret studi divers popular principl wide adopt literatur show optim divers gener np hard distinct sensit valu microdata approxim algorithm develop dimension underli dataset algorithm trivial bound inform loss extens experi real dataset valid effect effici propos solut correl hide independ mask log footstep quantil summari entir histori quantil crucial type order statist databas extens research focus maintain space effici structur approxim quantil comput underli dataset updat exist solut design support current updat snapshot dataset queri past version data answer paper studi problem histor quantil search object enabl approxim quantil retriev snapshot dataset histori problem import analyz evolut distribut monitor qualiti servic queri optim tempor databas present formal result literatur prove theoret lower bound space cost support approxim histor quantil queri bound reveal fundament differ answer quantil queri past present time propos structur find approxim histor quantil show consum space lower bound squarelogarithm factor extens experi demonstr practic techniqu perform predict theori quantil return remark accur theoret precis guarante transpar anonym thwart adversari algorithm effici accur nearest neighbor closest pair search high ddimension space transpar anonym thwart adversari algorithm supersed nearest neighbor search uncertain spatial databas paper propos problem call supersed nearest neighbor search uncertain spatial databas object multidimension probabl densiti function queri point object nearest neighbor nn candid probabl nn nn candid supersed closer object supersed nearest neighbor snn supersed nn candid object supersed nn candid case return snncore minimum set nn candid supersed nn candid snn core intuit snn core object object snn core wors object snn core show snn core effici comput util convent multidimension index confirm extens experi continu privaci preserv publish data stream recent privaci preserv data publish receiv lot attent research applic previou studi focu static data set paper studi emerg problem continu privaci preserv publish data stream solv straightforward extens exist privaci preserv publish method static data tackl problem develop approach consid distribut data entri publish statist distribut data stream extens perform studi real data set synthet data set verifi effect effici method find frequent doccur term relat keyword search privaci preserv publish multipl quasi didentifi scalabl keyword search larg data stream uncertain locat base rang aggreg multi ddimension space abstract uncertain data inher applic environment surveil quantit econom research recent consider research effort put field analys uncertain data paper studi problem process uncertain locat base rang aggreg multi dimension space formal introduc problem propos gener filter verif framework solv problem filter techniqu name stf pcr propos signficantli reduc verif cost queri commun relat databas abstract keyword search relat databas user insight easili observ tradit rdbm techniqu keyword queri set keyword kl find tupl keyword connect relat databas foreign kei refer conceptu find structur inform databas graph node tupl edg foreign kei refer exist work studi find connect tree keyword queri tree show partial inform tupl keyword connect paper focu find commun keyword queri commun induc subgraph keyword distanc propos effici algorithm find top commun consum small memori keyword queri topk keyword queri algorithm user interact enlarg run time conduct extens perform studi larg real dataset confirm effici algorithm distanc dbase repres skylin abstract integ arepres skylin skylin point describ tradeoff dimens offer full skylin topic previous studi exist solut produc point arbitrarili tini cluster fail repres motiv propos definit repres skylin minim distanc repres skylin point nearest repres studi algorithm comput distanc base repres skylin space dynam program algorithm guarante optim solut dimension prove problem np hard give approxim polynomi time algorithm multidimension access method algorithm directli report repres skylin retriev full skylin show repres skylin captur contour entir skylin previou method comput faster index uncertain data paper examin problem distanc function comput index uncertain data high dimension nearest neighbor rang queri inher nois uncertain data tradit distanc function measur lqmetric probabilist variant qualit effect problem magnifi sparsiti issu high dimension paper examin method comput distanc function high dimension data qualit effect friendli index paper show construct effect index structur order handl uncertain similar rang queri high dimension typic rang queri high dimension space subset rang order resolv queri desir run similar queri subset larg number dimens queri difficult resolv tradit index structur entir set dimens propos queri process techniqu effect search method index order comput final result discuss experiment result number real synthet data set term effect effici show propos distanc measur effect tradit lq norm comput effici propos index structur qualiti effici high dimension nearest neighbor search nearest neighbor nn search high dimension space import problem applic ideal practic solut implement relat databas ii queri cost grow linearli dataset size data queri distribut bulk nn literatur solut fulfil requir local sensit hash lsh exist lsh implement rigor adhoc rigor lsh ensur good qualiti queri result requir expens space queri cost adhoc lsh effici abandon qualiti control neighbor output arbitrarili bad result method ensur qualiti effici simultan practic motiv propos access method call local sensit tree lsb tree enabl fast highdimension nn search excel qualiti combin lsb tree lead structur call lsb forest ensur result qualiti rigor lsh reduc space queri cost dramat lsb forest outperform adhoc lsh qualiti guarante appeal theoret properti lsb tree serv effect index consum linear space support effici updat extens experi confirm lsb tree faster state art exact nn search order magnitud ii linear space method approxim retriev order magnitud time return neighbor qualiti revers nearest neighbor queri paper discuss static dynam data structur answer revers nearest neighbor queri dimens spatio dtempor data warehous spatio tempor databas store inform posit individu object time applic traffic supervis mobil commun system summar data averag number car area specif period phone servic cell dai requir inform obtain oper databas comput expens render onlin process inapplic vital solut construct spatiotempor data warehous paper describ framework support olap oper spatiotempor data argu spatial tempor dimens model combin dimens data cube present data structur integr spatiotempor index pre aggreg materi techniqu requir priori knowledg group hierarchi develop method util propos structur effici execut ad hoc group by techniqu static dynam dimens hard approxim algorithm ddivers exist solut privaci preserv public classifi theoret heurist categori guarante provabl low inform loss incur gigant loss worst case shown empir perform real input numer heurist algorithm develop satisfi advanc privaci principl divers close theoret categori limit anonym earliest principl sever vulner privaci attack motiv present theoret studi divers popular principl wide adopt literatur show optim divers gener np hard distinct sensit valu microdata approxim algorithm develop dimension underli dataset algorithm trivial bound inform loss extens experi real dataset valid effect effici propos solut divers skylin integ divers skylin skylin point describ tradeoff dimens offer full skylin paper overview latest result topic specif describ state art formul divers skylin explain algorithm find divers skylin object save cost avoid comput entir skylin discuss polynomi time algorithm space return exact result np hard problem dimension approxim solut good qualiti guarante effici evalu probabilist advanc spatial queri existenti uncertain data abstract studi problem answer spatial queri databas object exist uncertainti existenti probabl goal threshold probabilist spatial queri retriev object qualifi spatial predic probabl exce threshold rank probabilist spatial queri select object highest probabl qualifi spatial predic propos adapt spatial access method search algorithm probabilist version rang queri nearest neighbor spatial skylin revers nearest neighbor conduct extens experiment studi evalu effect propos solut index term queri process spatial databas cost dbase predict spatiotempor join distribut skylin retriev low bandwidth consumpt skylin comput underli dataset horizont partit geograph distant server connect internet exist solut suitabl problem drawback applic distribut system adopt vertic partit restrict horizont partit ii effect server limit comput commun abil iii optim skylin search subspac ineffici full space paper propos algorithm call feedback base distribut skylin fd support arbitrari horizont partit fd aim minim network bandwidth measur number tupl transmit network core fd feedback driven mechan coordin iter transmit feedback particip particip leverag inform prune larg amount local data coordin extens experiment confirm fd significantli outperform altern approach effect progress angel enhanc util gener privaci preserv public gener method privaci preserv data public vast popular drawback heavi inform loss difficulti support margin public overcom drawback develop angel anonym techniqu effect gener privaci protect retain significantli inform microdata angel applic monoton principl divers close superior correl preserv obviou tight privaci control enforc show angel lend elegantli hard problem margin public unlik gener releas restrict margin techniqu easili publish margin strong privaci guarante optim random perturb multipl privaci level random perturb popular method comput anonym data privaci preserv data mine simpl appli ensur strong privaci protect permit effect mine larg varieti data pattern exist studi good privaci guarante focu perturb singl privaci level fix degre privaci protect impos anonym data releas data holder drawback limit applic random perturb scenario holder numer recipi privaci level appli motiv studi problem multi level perturb object releas multipl version dataset anonym privaci level challeng recipi collud share data infer privaci permit level solut overcom obstacl achiev crucial properti collus useless mean collud recipi learn trustabl recipi collud recipi data recipi receiv regard analyz output convent uniform perturb solid theoret foundat propos techniqu space econom computation effici requir expect space produc anonym version logm expect time cardin origin dataset number version releas previous bound optim realist assumpt skylin flexibl domin relat abstract set dimension object skylin queri find object skylin domin skylin provid queri result user exist method skylin queri drawback size skylin object control increas decreas skylin object built rank skylin reflect user weight prefer dimens paper propos unifi approach skylin effect solv drawback explor properti skylin propos algorithm comput skylin anonym spars high ddimension data abstract exist research privaci preserv data publish focus relat data context object enforc privaci preserv paradigm kanonym divers minim inform loss incur anonym process maxim data util exist techniqu adopt index clusteringbas approach work fix schema data low dimension applic requir privaci preserv publish transact data basket data involv hundr thousand dimens render exist method unus propos anonym method spars highdimension data emploi represent captur correl underli data facilit format anonym group low inform loss propos effici anonym algorithm base represent show experiment real life dataset method outperform exist state art term data util comput overhead anti dcorrupt privaci preserv public abstract paper deal type privaci threat call corrupt anonym data public specif adversari corrupt individu obtain sensit valu consult releas inform convent gener lead sever privaci disclosur presenc corrupt motiv advoc altern anonym techniqu integr gener perturb stratifi sampl integr strong privaci guarante adversari corrupt number individu verifi effect propos techniqu experi real data dynam anonym accur statist analysi privaci preserv queri answer techniqu uncertain probabilist data tutori summari uncertain data inher import applic environment surveil market analysi quantit econom research due import applic rapidli increas amount uncertain data collect accumul analyz larg collect uncertain data import task attract interest databas commun recent uncertain data manag emerg hot area databas research develop tutori systemat review repres studi answer queri uncertain probabilist data preserv proxim privaci publish numer sensit data index bdual tree nearest neighbor queri network databas frequent type queri spatial network road network find nearest neighbor knn queri object queri spatio dtempor databas time parameter output perturb queri relax bdual dtree index move object space fill curv dual space primal dual promis faster spatiotempor search exist predict spatiotempor index classifi categori depend base primal dual methodolog gain consider empir knowledg access method limit understand theoret characterist methodolog fact experiment result paper contradict rel superior primal dual techniqu paper present care studi queri perform gener primal dual index reveal import insight behavior techniqu mathemat establish condit determin superior methodolog provid rigor justif observ properli explain literatur analyt find resolv contradict experi previou work vldb journal effici tempor count bound error paper studi aggreg search transact time databas specif object databas model horizont segment project search kei project repres period kei valid histori queri timestamp qt kei rang qk count queri retriev number object aliv qt kei fall qk provid method accur answer queri error naliv qt naliv qt number object aliv time qt constant denot disk page size techniqu requir space process queri logb time support updat logb amort os demonstr extens experi propos solut guarante queri result extrem high precis median rel error consum fraction space occupi exist approach promis precis result vldb journal multidimension danonym local recod gener paper present theoret studi local recod gener lrg comput kanonym tabl qualiti guarante prove np hard find tabl maximum qualiti discov solut approxim ratio develop algorithm good balanc approxim ratio time complex qualiti solut verifi experi dinvari privaci preserv dpublic dynam dataset continu constraint queri evalu spatiotempor stream abstract paper studi evalu continu constraint queri ccq spatiotempor stream ccq trigger alert configur constraint stream event space time satisfi instanc server receiv updat gp enabl agent report posit measur environment read ccq alert read closer km time differ minut report high pressur low temperatur model ccq constraint satisfact problem csp develop solut continu evalu techniqu fast arriv rate incom event minim memori requir predefin window constraint util structur queri order show merit propos techniqu implement system prototyp evalu real data continu constraint queri evalu spatiotempor stream abstract paper studi evalu continu constraint queri ccq spatiotempor stream ccq trigger alert configur constraint stream event space time satisfi instanc server receiv updat gp enabl agent report posit measur environment read ccq alert read closer km time differ minut report high pressur low temperatur model ccq constraint satisfact problem csp develop solut continu evalu techniqu fast arriv rate incom event minim memori requir predefin window constraint util structur queri order show merit propos techniqu implement system prototyp evalu real data effici spatial match mail address rang search multidimension uncertain data uncertain databas object probabl densiti function describ likelihood appear posit multidimension workspac articl studi type rang retriev fundament analyt task specif nonfuzzi queri return object search region rq probabl tq hand uncertain object fuzzi search retriev set object distanc probabl tq core methodolog concept probabilist constrain rectangl permit effect prune valid nonqualifi qualifi data develop index structur call tree minim queri overhead algorithm find accompani theoret analysi reveal valuabl insight problem characterist mathemat confirm effici solut verifi effect propos techniqu extens effici top dk process larg dscale distribut environ random sampl continu stream arbitrari updat effici skylin top dk retriev subspac skylin top queri popular oper prefer retriev practic applic requir oper provid numer candid attribut depend interest user issu queri subset dimens exist algorithm inadequ subspac skylin top search defect requir scan entir databas ii optim subspac incur signific overhead subspac iii demand expens mainten cost space consumpt paper propos techniqu subski settl type queri pure relat technolog core subski transform convert multidimension data valu valu index simpl tree answer subspac queri access fraction databas subski entail low mainten overhead equal cost updat tradit tree extens experi real data confirm techniqu outperform altern solut significantli effici scalabl branch dand dbound process rank queri import rank queri numer applic involv multi criteria decis make effici support tradit databas system paper propos simpl power techniqu process queri base multidimension access method branch bound search advantag propos methodolog space effici requir singl index relat store tupl ii achiev signific order magnitud perform gain respect current state art iii effici handl data updat iv applic import variat rank search includ support monoton prefer function extra space overhead confirm superior propos method detail experiment studi multidimension revers nn search multi dimension point revers nearest neighbor rknn queri retriev data point nearest neighbor exist method process queri defici support arbitrari valu ii deal effici databas updat iii applic data higher dimension iv retriev approxim result motiv shortcom develop algorithm exact rknn process arbitrari valu dynam multi dimension dataset method util convent data partit index dataset requir pre comput step extend propos techniqu continu rknn search return rknn result point line segment evalu effect algorithm extens experi real synthet dataset privaci preserv data public gener anatomi effici quantil retriev multi ddimension data abstract set multi dimension point studi comput quantil rank function provid user runtim specif comput score base coordin point object report object score smallest dataset quantil provid succinct summari distribut underli data onlin decis support data mine select estim queri optim assum dataset index spatial access method propos algorithm retriev quantil effici analyt experiment result demonstr branch bound method highli effect practic outperform altern approach signific factor process rank queri minimum space abstract practic applic rank multi variat record assign prioriti attribut relat store student grade cours databas algorithm student perform evalu score calcul gdb galg wherew input weight gdb galg student grade databas algorithm top rank queri retriev student score specif focu top queri bound constant present solut guarante low worst case queri cost provabl minimum space core method concept minimum cover subset data ensur correct answer queri rank search process log os space size minimum cover subset disk page capac similar result deriv higher dimension approxim rank retriev subski effici comput skylin subspac set multi dimension point skylin point prefer function monoton ax practic applic requir skylin analysi provid numer candid attribut user depend interest issu queri small subset dimens formal relat larg number gt attribut queri aim find skylin arbitrari subspac low dimension exist algorithm support subspac skylin retriev effici requir scan entir databas ii optim subspac incur signific overhead subspac paper propos techniqu subski settl problem singl tree implement relat databas core sky transform convert multi dimension data valu enabl effect prune heurist extens experi real data confirm subski outperform altern approach significantli effici scalabl mine distanc dbase outlier larg databas metric space set object object outlier exist object distanc valu distanc metric provid user run time object return outlier smallest cost paper consid gener version problem inform outlier comput object mutual distanc prove upper bound memori consumpt permit discoveri outlier scan dataset time upper bound turn extrem low practic actual memori capac realist dbm typic larger develop algorithm integr theoret find carefullydesign heurist leverag addit memori improv effici techniqu report outlier scan dataset case significantli outperform exist solut factor order magnitud person privaci preserv studi gener preserv privaci public sensit data exist method focu univers approach exert amount preserv person cater concret consequ offer insuffici protect subset peopl appli excess privaci control subset motiv present gener framework base concept person anonym techniqu perform minimum gener satisfi requir retain largest amount inform microdata carri care theoret studi lead valuabl insight behavior altern solut analysi mathemat reveal circumst previou work fail protect privaci establish superior propos solut theoret find verifi extens experi anatomi simpl effect privaci preserv progress comput min ddist optim dlocat queri paper propos solv min dist optim locat queri spatial databas set site set weight object spatial region min dist optim locat queri return locat site built minim averag distanc object closest site queri franchis mcdonald decid put store order maxim benefit custom solv problem challeng theoret infinit number locat candid paper theorem limit number candid locat lose power find exact answer progress algorithm quickli suggest locat tell maximum error refin result algorithm finish exact answer found intermedi result earli run prune search space run crucial prune techniqu lower bound estim propos algorithm effect optim progress experiment evalu multidimension subspac skylin analysi skylin oper import multicriteria decis make applic recent studi develop effici method comput skylin object space consid skylin multipl subspac simultan importantli fundament spatial queri estim local uniform assumpt maintain slide window skylin data stream abstract skylin multidimension data set tupl prefer function monoton dimens skylin comput receiv consider attent convent databas exist algorithm inapplic stream applic assum static data store disk continu arriv expir focu time execut return singl skylin contrast constantli track skylin aim reduc overhead oppos minim cpu cost main memori consumpt paper studi skylin comput stream environ queri process take account slide window cover recent tupl propos algorithm continu monitor incom data maintain skylin increment techniqu util interest properti stream skylin improv space time effici expung data system earli expir analyz asymptot perform propos solut evalu effici extens experi index term skylin stream databas algorithm revers nearest neighbor larg graph abstract revers nearest neighbor rnn queri return data object queri point nearest neighbor nn queri studi extens euclidean space previou work context larg graph paper provid fundament lemma prune search space travers graph search rnn base develop rnn method eager algorithm attempt prune network node visit lazi techniqu prune search space data point discov studi retriev arbitrari number revers nearest neighbor investig benefit materi cover queri type deal case queri data object resid node edg graph propos techniqu evalu practic scenario involv spatial map comput network dblp coauthorship graph index term queri process spatial databas graph network revers nearest neighbor search metric space abstract set object revers nearest neighbor rnn queri return object closer queri object object similar metric exist rnn solut suffici reli precomput inform expens maintain presenc updat applic data consist euclidean object similar measur norm paper present algorithm effici rnn search gener metric space techniqu requir detail represent object appli long mutual distanc comput distanc metric satisfi triangl inequ confirm effect propos method extens experi index term revers nearest neighbor metric space spatio dtempor join select move object databas manag spatial object continu chang posit extent time recent found larg interest databas commun queri move object interest tempor topolog relationship evolv spatial object concept spatio tempor predic propos describ relationship goal paper design effici algorithm spatiotempor join select paper propos design algorithm predic individu emploi gener algorithm scheme cover present futur predic definit spatio dtempor join select move object databas manag spatial object continu chang posit extent time recent found larg interest databas commun queri move object interest tempor topolog relationship evolv spatial object concept spatio tempor predic propos describ relationship goal paper design effici algorithm spatiotempor join select paper propos design algorithm predic individu emploi gener algorithm scheme cover present futur predic definit revers nearest neighbor larg graph abstract revers nearest neighbor rnn queri return data object queri point nearest neighbor nn queri studi extens euclidean space previou work context larg graph paper provid fundament lemma prune search space travers graph search rnn base develop rnn method eager algorithm attempt prune network node visit lazi techniqu prune search space data point discov studi retriev arbitrari number revers nearest neighbor investig benefit materi cover queri type deal case queri data object resid node edg graph propos techniqu evalu practic scenario involv spatial map comput network dblp coauthorship graph index term queri process spatial databas graph network venn sampl predict techniqu move object region qr futur timestamp qt rang aggreg queri estim number object expect qr time qt method process queri base spatiotempor histogram problem consum consider space order provid accur estim incur high evalu cost effici continu deterior time fourth mainten requir signific updat overhead motiv develop venn sampl estim method optim set pivot queri reflect distribut actual pivot queri achiev perfect estim sampl oppos requir current state art workload awar sampl compar histogram techniqu accur space produc estim neglig cost deterior time permit develop queri driven updat polici reduc updat cost convent polici significantli rpj produc fast join result stream rate dbase optim probabilist spatial queri existenti uncertain data abstract studi problem answer spatial queri databas object exist uncertainti existenti probabl goal threshold probabilist spatial queri retriev object qualifi spatial predic probabl exce threshold rank probabilist spatial queri select object highest probabl qualifi spatial predic propos adapt spatial access method search algorithm probabilist version rang queri nearest neighbor conduct extens experiment studi evalu effect propos solut catch view skylin semant approach base decis subspac skylin oper import multicriteria decis make applic recent studi develop effici method comput skylin object specif space fundament problem semant skylin remain open subspac object skylin practic user interest skylin subspac relationship skylin subspac super space effect analyz subspac skylin effici comput skylin subspac paper investig semant skylin propos subspac skylin analysi extend full space skylin comput subspac skylin comput introduc notion skylin group essenti group object coincident skylin subspac identifi decis subspac qualifi skylin group subspac skylin notion concis captur semant structur skylin subspac multidimension roll drilldown analysi introduc develop index multi ddimension uncertain data arbitrari probabl densiti function uncertain databas object multi dimension probabl densiti function pdf describ likelihood appear posit data space fundament oper probabilist rang search pq rectangular area rq retriev object rq probabl pq paper propos tree access method design optim cpu time rang retriev multi dimension imprecis data structur fulli dynam object increment insert delet order place constraint data pdf verifi queri updat effici tree extens experi progress skylin comput databas system skylin dimension dataset point domin point dimens skylin comput recent receiv consider attent databas commun progress method quickli return initi result read entir databas exist algorithm shortcom limit applic practic articl develop branch andbound skylin bb algorithm base nearest neighbor search optim perform singl access node skylin point bb simpl implement support type progress process user prefer arbitrari dimension propos interest variat skylin comput show bb appli effici process aggreg nearest neighbor queri spatial databas spatial dataset facil queri aggreg nearest neighbor ann queri retriev point smallest aggreg distanc point assum user locat qn anann queri output facil minim sum distanc pqi user travel order meet similarli ann queri report point minim maximum distanc user travel minimum distanc user closest facil fit memori index tree develop algorithm aggreg nearest neighbor captur version problem includ weight queri increment report result analyz perform propos cost model queri optim final extend techniqu disk resid queri approxim ann retriev effici algorithm accuraci cost model evalu extens experi real synthet dataset histor spatio dtempor aggreg spatio tempor databas store inform posit individu object time applic traffic supervis mobil commun system summar data number car area specif period phone call servic cell dai requir inform obtain oper databas comput expens render onlin process inapplic paper present special method integr spatio tempor index pre aggreg method support dynam spatio tempor dimens effici process histor aggreg queri priori knowledg group hierarchi superior propos techniqu exist method demonstr comprehens probabilist analysi extens experiment evalu threshold dbase algorithm continu monitor nearest neighbor abstract assum set move object central server monitor posit time process continu nearest neighbor queri geograph distribut client order report date result server constantli obtain recent posit object na ve solut requir transmiss larg number rapid data stream locat updat intuit current inform object influenc queri result includ nearest neighbor set client motiv observ present threshold base algorithm continu monitor nearest neighbor minim commun overhead server data object propos method multipl static move queri distanc definit requir addit knowledg veloc vector object locat index term spatial databas locat depend sensit queri process approxim tempor aggreg tempor aggreg queri retriev summar inform record time evolv attribut exist approach shortcom incur larg space requir ii high process cost iii base complex structur commerci system paper solv problem approxim techniqu bound error propos method base multivers tree logarithm worst case queri cost techniqu shelf rtree achiev perform expect case experiment demonstr propos method consum order magnitud space competitor significantli faster case permiss error bound small queri past present futur spatio dtempor move object vehicl road network continu gener larg amount spatio tempor inform form data stream effici manag stream challeng goal due highli dynam natur data fast line comput paper present approach approxim queri process present past futur spatio tempor databas propos increment updat multi dimension histogram present time queri develop gener architectur maintain queri histor data implement stochast approach predict result queri refer futur final experiment prove effect effici techniqu realist simul group nearest neighbor queri set point group nearest neighbor gnn queri retriev point smallest sum distanc point instanc user locat find meet point restaur queri return data point minim sum euclidean distanc pqi assum fit memori index tree propos algorithm find group nearest neighbor effici step extend techniqu situat fit memori cover index index queri point experiment evalu identifi altern base data queri properti spatio dtempor aggreg sketch spatio tempor applic requir retriev summar inform move object lie queri region queri interv number mobil user cover cell traffic volum district exist solut distinct count problem object remain queri region timestamp queri interv count multipl time result paper solv problem integr spatio tempor index sketch tradition approxim queri process propos techniqu appli reduc space requir convent spatiotempor data mine spatio tempor associ rule group nearest neighbor queri set point group nearest neighbor gnn queri retriev point smallest sum distanc point instanc user locat find meet point restaur queri return data point minim sum euclidean distanc pqi assum fit memori index tree propos algorithm find group nearest neighbor effici step extend techniqu situat fit memori cover index index queri point experiment evalu identifi altern base data queri properti mine index queri histor spatiotempor data abstract larg spatio tempor databas event event consist field event id time locat event type mine spatio tempor sequenti pattern identifi signific event type sequenc spatio tempor sequenti pattern crucial investig spatial tempor evolut phenomena applic domain recent research literatur explor sequenti pattern transact data trajectori analysi move object method directli appli mine sequenti pattern larg number spatio tempor event major research challeng remain definit signific measur spatio tempor sequenti pattern avoid spuriou algorithm design signific measur guarante downward closur properti paper propos sequenc index signific measur spatio tempor sequenti pattern meaning due interpret spatial statist propos algorithm call slice st miner tackl algorithm design challeng spatial sequenc index preserv downward closur properti compar propos algorithm simpl algorithm call st miner util weak monoton properti sequenc index perform evalu synthet real world data set show slice st miner order magnitud faster st miner larg data set index term spatio tempor sequenti pattern densiti ratio sequenc index slice perform predict index move object unknown motion pattern exist method predict spatio tempor databas assum object move linear function sever limit applic practic movement complex individu object follow drastic motion pattern order overcom problem introduc gener framework monitor index move object object comput individu function accur captur movement ii server index object locat coars level process queri filter refin mechan contribut recurs motion function support broad class linear motion pattern function presum priori movement postul motion object examin locat recent timestamp final propos effici index scheme facilit process predict queri fals miss dnearest dneighbor queri spatial databas set multidimension object nearest neighbor ann queri retriev object nearest neighbor oper common applic receiv attent databas literatur paper studi altern method process ann queri depend index algorithm evalu extens experiment synthet real dataset perform studi show order magnitud faster previou approach base closest pair queri process revers knn search arbitrari dimension point revers nearest neighbor rknn queri retriev data point nearest neighbor exist method process queri applic data higher dimension iv retriev approxim result motiv shortcom develop algorithm exact process rknn arbitrari valu dynam multidimension dataset method util convent data partit index dataset requir pre comput addit flexibl experiment verifi propos algorithm outperform exist restrict focu rang aggreg process spatial databas abstract rang aggreg queri return summar inform point fall hyper rectangl total number point concret id paper studi spatial index solv queri effici propos aggreg point tree ap tree achiev logarithm cost data set cardin independ queri size dimension data ap tree requir small modif popular multivers structur framework implement appli easili practic present model accur predict space consumpt queri cost ap tree suitabl queri optim extens experi confirm propos method effici practic index term databas spatial databas rang queri aggreg perform analysi dtree arbitrari node extent abstract exist analysi tree inadequ tradit emerg applic includ tempor spatio tempor multimedia databas base assumpt extent node ident dimens satisfi domain paper propos analyt model accur predict tree perform assumpt deriv base concept extent regress function comput node extent function number node split detail experiment evalu reveal propos model accur case previou method fail complet index term databas spatial databas tree cost model power dmethod comprehens estim techniqu multi ddimension queri exist estim approach multi dimension databas reli assumpt data distribut small region uniform seldom hold practic applic limit specif estim task distanc metric paper develop power method comprehens techniqu applic wide rang queri optim problem metric powermethod elimin local uniform assumpt accur scenario exist approach complet fail perform estim evalu simpl formula minim comput overhead extens experi confirm powermethod outperform previou techniqu term accuraci applic optim scenario select estim predict spatio dtempor queri paper propos cost model select estim predict spatio tempor window queri initi focu uniform data propos formula captur point rectangl type object queri mobil combin dynam object dynam queri appli model uniform dataset introduc spatio tempor histogram addit spatial veloc distribut partit advantag techniqu high accuraci order magnitud lower error previou techniqu ii abil handl queri type iii effici handl updat optim progress algorithm skylin queri skylin set dimension point point domin point dimens skylin comput recent receiv consider attent databas commun progress onlin algorithm quickli return skylin point read entir data file effici algorithm nn nearest neighbor appli divideand conquer framework dataset index tree nn desir featur high speed return initi skylin point applic arbitrari data distribut dimens present inher disadvantag duplic elimin gt multipl access node larg space overhead paper develop bb branch bound skylin progress algorithm base nearest neighbor search io optim perform singl access tree node skylin point retriev duplic space overhead significantli smaller nn final bb simpl implement effici appli varieti altern skylin queri analyt experiment comparison show bb outperform nn order magnitud problem instanc valid inform retriev spatio dtempor queri theoret perform bound result tradit spatial queri rang search nearest neighbor meaningless spatio tempor applic invalid movement queri data object practic queri result accompani valid inform futur time expir ii chang time updat increment algorithm propos problem worst case perform sequenti scan paper present theoret studi valid queri develop index algorithm attract complex analysi predict spatio dtempor queri paper present probabilist cost model estim select spatio tempor window queri join expect distanc queri nearest neighbor model captur queri object mobil combin move queri move object data type point rectangl arbitrari dimension addit develop special spatio tempor histogram account locat veloc inform increment maintain extens perform evalu verifi propos techniqu produc highli accur estim uniform uniform data tpr dtree optim spatio dtempor access method predict queri predict spatio tempor queri retriev set move object intersect queri window futur time interv access method process queri practic tpr tree paper perform analysi determin factor affect perform predict queri show factor consid tpr tree insert delet algorithm tree design static data motiv propos index structur call tpr tree take account uniqu featur dynam object set improv construct algorithm addit provid cost model determin optim perform achiev data partit spatio tempor access method experiment comparison illustr tpr tree optim significantli outperform tpr tree condit queri process spatial network databas import spatial network real life applic spatial databas literatur focus euclidean space paper propos architectur integr network euclidean inform captur pragmat constraint base architectur develop euclidean restrict network expans framework advantag locat connect effici prune search space framework successfulli appli popular spatial queri nearest neighbor rang search closest pair edist join context spatial network databas spatial queri dynam environ paper formul queri type time parameter continu queri applic environ timeparameter queri retriev actual result time queri issu expiri time result current motion queri databas object chang expir continu queri retriev tupl form lt result interv gt result accompani futur interv valid studi time parameter continu version common spatial queri window queri nearest neighbor spatial join propos effici process algorithm accur cost model analysi predict spatio dtempor queri paper present probabilist cost model estim select spatio tempor window queri join expect distanc queri nearest neighbor model captur queri object mobil combin move queri move object data type point rectangl arbitrari dimension addit develop special spatio tempor histogram account locat veloc inform increment maintain extens perform evalu verifi propos techniqu produc highli accur estim uniform uniform data recent progress select topic databas research report young chines research work unit state aggreg process planar point aggreg window queri return summar inform object fall insid queri rectangl number object concret id tradit approach process queri retriev consider extra inform compromis process cost index spatio dtempor data warehous spatio tempor databas store inform posit individu object time applic traffic supervis mobil commun system summar data averag number car area specif period phone servic cell dai requir inform obtain oper databas comput expens render onlin process inapplic vital solut construct spatiotempor data warehous paper describ framework support olap oper spatiotempor data argu spatial tempor dimens model combin dimens data cube present data structur integr spatiotempor index pre aggreg materi techniqu requir priori knowledg group hierarchi develop method util propos structur effici execut ad hoc group by techniqu static dynam dimens cost model overlap multi dversion dtree overlap multi version techniqu popular framework transform ephemer index multtl logic tree structur order support version databas framework produc numer effcient index method perform analysi limit result clear understand behavior altern structur choic data queri characterist queri optim base method imposs problem due incorpor overlap multi version techniqu tradit bank emerg spatio temporao applic paper propos framework reduc perform analysi overlap multi version structur ephemer structur simpli problem significantli framework lead accur cost model predict size tree node access queri select focu tree base structur propos model emploi varieti index time dparameter queri spatio dtempor databas time parameter queri tp queri short retriev actual result time queri issu ii valid period result current motion queri databas object iii chang expir result due highli dynam natur spatio tempor applic tp queri import standalon method build block complex oper work effici process paper propos gener framework cover time parameter variat common spatial queri window queri nearest neighbor spatial join tp queri reduc nearest neighbor search distanc function def med queri type reduct applic extens branch bound techniqu current problem propos method appli mobil queri mobil object suitabl index method experiment evalu base tree extens dynam object adapt index structur tradit index aim optim node access queri process necessarili minim total cost due possibl larg number random access paper propos gener framework adapt index improv queri cost perform gain achiev allow index node variabl number disk page updat algorithm dynam structur adapt index depend data queri characterist extens experi show adapt tree significantli outperform convent counterpart incur minim updat overhead continu nearest neighbor search continu nearest neighbor queri retriev nearest neighbor nn point line segment find nearest ga station rout point point result set lt point interv gt tupl point nn point interv exist method continu nearest neighbor search base repetit applic simpl nn algorithm incur signific overhead paper propos techniqu solv problem perform singl queri input segment result cost depend queri dataset characterist drop order magnitud adapt index structur tradit index aim optim node access queri process necessarili minim total cost due possibl larg number random access paper propos gener framework adapt index improv queri cost perform gain achiev allow index node variabl number disk page updat algorithm dynam structur adapt index depend data queri characterist extens experi show adapt tree significantli outperform convent counterpart incur minim updat overhead cost model overlap multivers structur index retriev histor aggreg inform move object spatio tempor databas store inform posit individu object time applic traffic supervis mobil commun system summar data averag number car area specif period phone servic cell dai requir inform obtain oper databas comput expens render onlin process inapplic vital solut construct spatiotempor data warehous paper describ framework support olap oper spatiotempor data argu spatial tempor dimens model combin dimens data cube present data structur integr spatiotempor index pre aggreg materi techniqu requir priori knowledg group hierarchi develop method util propos structur effici execut ad hoc group by techniqu static dynam dimens effici histor dtree effici olap oper spatial data warehous spatial databas store inform posit individu object space applic traffic supervis mobil commun summar data number car area phone servic cell requir inform obtain transact spatial databas comput expens render onlin process inapplic driven spatial paradigm spatial data warehous construct acceler spatial olap oper paper star schema focu spatial dimens unlik spatial case group hierarchi spatial dimens numer unknown design time materi techniqu directli applic order address problem construct ad hoc group hierarchi base spatial index finest spatial granular incorpor mv dtree spatio dtempor access method timestamp interv queri 